Succinct: Enabling Queries on Compressed Data Rachit Agarwal, Anurag Khandelwal, and Ion Stoica, University of California, Berkeley https://www.usenix.org/conference/nsdi15/technical-sessions/presentation/agarwal This pa

Source URL: www.usenix.org

• Data management
• Computing
• Data
• Structured storage
• NoSQL
• Database management systems
• Distributed computing architecture
• Wavelet Tree
• Compressed suffix array
• MongoDB
• Apache Cassandra
• Compressed data structure

Space-Efficient Data Structures for Top-k Completion Bo-June (Paul) Hsu Giuseppe Ottaviano Microsoft Research

Source URL: www2013.wwwconference.org

• Computer programming
• Software engineering
• Computing
• Search algorithms
• Finite automata
• Trie
• Radix tree
• Binary trees
• Arrays
• Routing algorithms
• Suffix tree
• Tree

LU-CS-TR:LUNFD6/(NFCS–)], Lund University, Sweden NOTES ON SUFFIX SORTING N. JESPER LARSSON Abstract. We study the problem of lexicographically sorting the suffixes of a string of symbols. In pa

Source URL: www.larsson.dogma.net

• Sorting algorithms
• Order theory
• Computing
• Mathematics
• Suffix array
• Quicksort
• Suffix tree
• Radix sort
• Bucket sort
• Best
• worst and average case
• Sort
• LCP array

A Suffix Tree Or Not A Suffix Tree? Tatiana Starikovskaya1 , Hjalte Wedel Vildhøj2 1 National Research University Higher School of Economics (HSE) 2

Source URL: www.hwv.dk

A Suffix Tree Or Not A Suffix Tree? Tatiana Starikovskaya1 Higher School of Economics (Russia), Hjalte Wedel Vildhøj Technical University of Denmark, DTU Compute,

Source URL: www.hwv.dk

Algorithms on Strings Maxime Crochemore Christophe Hancart Thierry Lecroq

Source URL: monge.univ-mlv.fr

• Combinatorics on words
• String
• String matching algorithms
• Automata theory
• Pattern matching
• Suffix array
• String searching algorithm
• Suffix tree
• Alphabet
• Formal languages
• Combinatorics
• Mathematics

Solution sheet High Throughput Sequencing Methods Bioinformatics Leipzig WS 13/14 Solution sheet

Source URL: www.bioinf.uni-leipzig.de

• Suffix tree
• Suffix array
• Burrows–Wheeler transform
• Substring
• Eulerian path
• Subsequence
• De Bruijn
• Sequence assembly
• Mathematics
• Mathematical analysis
• Computing

C:/Users/ShoshanaN/Desktop/research/dissertation/thesis/before final version/thesisSN.dvi

Source URL: schatzlab.cshl.edu

• Computer programming
• Algorithm
• Suffix array
• Data management
• Computing
• Suffix tree
• Compressed data structure

Exercise sheet High Throughput Sequencing Methods Bioinformatics Leipzig WS 13/14 Exercise sheet

Source URL: www.bioinf.uni-leipzig.de

• Arrays
• Suffix array
• Suffix tree
• Burrows–Wheeler transform
• Substring
• FM-index
• String
• De Bruijn
• Computing
• Computer programming
• Mathematics

Approximate Parameterized Matching CARMIT HAZAY AND MOSHE LEWENSTEIN Bar-Ilan University AND DINA SOKOL

Source URL: www.eng.biu.ac.il

• String matching algorithms
• Analysis of algorithms
• Donald Knuth
• Knuth–Morris–Pratt algorithm
• String searching algorithm
• Matching
• Time complexity
• Suffix tree
• Theoretical computer science
• Computational complexity theory
• Applied mathematics